Voronoi ' s Algorithm in Purely Cubic

نویسندگان

Renate Scheidler

Andreas Stein

چکیده

The rst part of this paper classi es all purely cubic function elds over a nite eld of characteristic not equal to 3. In the remainder, we describe a method for computing the fundamental unit and regulator of a purely cubic congruence function eld of unit rank 1 and characteristic at least 5. The technique is based on Voronoi's algorithm for generating a chain of successive minima in a multiplicative cubic lattice which is used for calculating the fundamental unit and regulator of a purely cubic number eld. Voronoi's Algorithm in Cubic Function Fields of Unit Rank 1 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Purely Cubic Function Fields With Short Periods

A “function field version” of Voronoi’s algorithm can be used to compute the fundamental unit of a purely cubic complex congruence function field of characteristic at least 5. This is accomplished by generating a sequence of minima in the maximal order of the field. The number of mimima computed is the period of the field. Generally, the period is very large — it is proportional to the regulato...

متن کامل

Dynamic Weighted Voronoi Diagrams and Weighted Minimax Matching of Two Corresponding Point Sets

A weighted geometric fitting problem between two corresponding sets of points is to minimize the maximum weighted distance between two corresponding pairs of points by translating and rotating one set to the other set. For this weighted geometric fitting problem, dynamic weighted Voronoi diagrams have been applied to obtain an almost cubic algorithm. In this paper, we show a new reduction of th...

متن کامل

Randomized construction diagrams * incremental of abstract Voronoi Rolf

Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...

متن کامل

Solving Cubic Equations By the Quadratic Formula

Let p(z) be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the Voronoi property if it lies in the Voronoi cell of a root θ, V (θ), i.e. the set of points that are closer to θ than to the other roots. We prove at least one critical point has the Voronoi property and characterize the cases when both satisfy this property. It is known...

متن کامل